Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge
نویسنده
چکیده
In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of non-invertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which we have an implementation. The ideas presented can be extended to intuitionistic logic as well.
منابع مشابه
Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus
We present a procedure to decide propositional Dummett logic. This procedure relies on a tableau calculus with a multiple premise rule and optimizations. The resulting implementation outperforms the state of the art graph-based procedure.
متن کاملA Tableau Calculus for Dummett Logic Based on Increasing the Formulas Equivalent to the True and the Replacement Rule
In this paper we present a multiple premise tableau calculus for propositional Dummett Logic. The aim is to improve the efficiency of the known decision procedures. The investigation is related to the possibility of reducing the size of the deduction by the replacement rule and rules that introduce formulas equivalent to the logical constant True. In this way we want to bound the application of...
متن کاملTaming Implications in Dummett Logic
This paper discusses a new strategy to decide Dummett logic. The strategy relies on a tableau calculus whose distinguishing features are the rules for implicative formulas. The strategy has been implemented and the experimental results are reported.
متن کاملRefutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World
In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of noninvertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which ...
متن کاملIndividual Reuse in Description Logic Reasoning
Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowledge bases (KBs), mainly because they end up building very large models. To address this, we propose a tableau calculus with individual reuse: to satisfy an existential assertion, our calculus nondeterministically tries to reus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010